A Note on Coarse Grained Parallel Integer Sorting
نویسندگان
چکیده
We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 n p -relations and 18 p-relations), O(n/p) memory per processor and O(n/p) local computation.
منابع مشابه
The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting
We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.
متن کاملInteger sorting algorithms for coarse-grained parallel machines
Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is polynomially bounded in the number of elements to be sorted. It is useful for applications in which the size of the maximum value of element to be sorted is bounded. In this paper, we present a new distributed radix-sort algorithm for integer sorting. The structure of our algor...
متن کاملA Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds, where p is the number of processors. It requires the solution of the Euler tour problem whic...
متن کاملReducing I/o Complexity by Simulating Coarse Grained Parallel Algorithms (1)
Block-wise access to data is a central theme in the design of eecient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper, we present a deterministic simulation technique which transforms Coarse Grained Multi-computer (CGM) algorithms into parallel external memory algorithms. It optimizes block-wise data access...
متن کاملReducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a deterministic simulation technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a deterministic simulation techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 9 شماره
صفحات -
تاریخ انتشار 1999